On Salié's sum

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...

متن کامل

Some new bounds on the general sum--connectivity index

Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...

متن کامل

On permutation sum sets

A permutation sum (resp. difference) set on a group G is a set F of bijections from G to G such that fg (resp. f−1g) is again a bijection for all f, g ∈ F (resp. f, g ∈ F with f 6= g ∈ S), where (fg)(x) := f(x)g(x) for all x ∈ G, etc. The maximum size d(G) of a permutation difference set has been well studied, with many connections drawn between such sets and combinatorial objects such as famil...

متن کامل

On integral sum graphs

A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f (u) + f (v) = f (w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated ...

متن کامل

On Zero - Sum Problems

Let G be an additive abelian group. The zero-sum problem for G asks for the least positive integer k such that for any a1, · · · , ak ∈ G there is an I ⊆ {1, · · · , k} of required cardinality satisfying ∑ i∈I ai = 0. In this talk we will introduce the famous theorem of P. Erdős, A. Ginzburg and A. Ziv (for G = Zn), and recent results of L. Rónya on the Kemnitz conjecture concerning the group Z...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1971

ISSN: 0022-314X

DOI: 10.1016/0022-314x(71)90006-0